One - way Accumulators : A Decentralized Alternative to Digital Signatures ( Extended Abstract )
نویسندگان
چکیده
This paper describes a simple candidate one-way hash function which satisfies a quasi-commutative property that allows it to be used aa an accumulator. This property allows protocols to be developed in which the need for a trusted central authority can be eliminated. Spaceefficient distributed protocols are given for document time stamping and for membership testing, and many other applications are possible.
منابع مشابه
One - Way Accumulators : A Decentralized Alternative to Digital
This paper describes a simple candidate one-way hash function which satis es a quasi-commutative property that allows it to be used as an accumulator. This property allows protocols to be developed in which the need for a trusted central authority can be eliminated. Space-e cient distributed protocols are given for document time stamping and for membership testing, and many other applications a...
متن کاملSecurity of Blind Digital Signatures (Extended Abstract)
Blind digital signatures were introduced by Chaum. In this paper, we show how security and blindness properties for blind digital signatures, can be simultaneously de ned and satis ed, assuming an arbitrary one-way trapdoor permutation family. Thus, this paper presents the rst complexity-based proof of security for blind signatures.
متن کاملCollision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
One-way accumulators, introduced by Benaloh and de Mare, can be used to accumulate a large number of values into a single one, which can then be used to authenticate every input value without the need to transmit the others. However, the one-way property does is not suucient for all applications. In this paper, we generalize the deenition of accumulators and deene and construct a collision-free...
متن کاملA Dynamic Digital Signature Scheme Without Third Parties
We propose a digital signature scheme for dynamic coalitions. Particularly, we enable members to join and leave. Our scheme does not need trusted or oblivious third parties (TTPs or OTPs). In this distributed scheme there is a changing secret group key dependent on the members in the group. Each member’s secret key remains the same for all group compositions. The downside of this approach is th...
متن کاملFail-Stop Signatures Without Trees
We construct the first fail-stop signature scheme where neither the signature length nor the length of the public key grows as a function of the number of messages that can be signed with one key. The computation needed for signing and testing is reduced similarly. This removes one of the main differences between the complexity of ordinary signature schemes and previous fail-stop signature sche...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993